Implementing APL-like data parallel functions on a GCA machine
نویسندگان
چکیده
We show how data parallel operations can be implemented on a Global Cellular Automaton (GCA). For this purpose we implement a number of frequently used functions of the language APL. APL has been chosen because of the ability to express matrix and vector operations in a short and concise manner. It is shown how various operations on vectors and matrices can be executed through the execution of appropriate GCA generation computations. Finally the architecture of the underlying GCA machine is presented which interprets GCA instructions in a pipelined manner and using several memories.
منابع مشابه
Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کاملCollection-oriented languages
Several programming languages arising from widely varying practical and theoretical considerations share a common high-level feature: their basic data type is an aggregate of other data types and their functional primitives operate on these aggregates. Examples of such languages and the collections they support are FORTRAN 90 and arrays, APL and arrays, Connection Machine LISP and xectors, PARA...
متن کاملGlobal Cellular Automata: a Path from Parallel Random Access Machines To Practical Implementations
The Parallel Random Access Machine (PRAM) and the Global Cellular Automaton (GCA) are both models to study parallel algorithms. We investigate the commonalities and di erences between these models, because we think that they could nicely complement each other: PRAMs have lots of algorithms, GCAs provide e cient implementation paths. We provide the following results: GCAs are CROW PRAMs, GCAs ha...
متن کاملA Representation Theorem for Primitive Recursive Algorithms
We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is pres...
متن کاملA Function-Composition Approach to Synthesize Fortran 90 Array Operations
An increasing number of programming languages, such as Fortran 90 and APL, are providing a rich set of intrinsic array functions and array expressions. These constructs which constitute an important part of data parallel languages provide excellent opportunities for compiler optimizations. In this paper, we present a new approach to combine consecutive array operations or array expressions into...
متن کامل